Unique-entry graphs, flowcharts, and state diagrams
نویسندگان
چکیده
منابع مشابه
An Efficient Unique State Coding Algorithm for Signal Transition Graphs
Current algorithms to force the Complete State Coding (CSC) property for Signal Transition Graphs work on the State Graph and, therefore require exponential time and space. Polynomial algorithms have been only proposed for Marked Graphs. In this paper, a P-time algorithm for Unique State Coding (USC) is presented. Although more restrictive than CSC, it is shown that the USC property can be eeci...
متن کاملCayley graphs and coset diagrams
Let G be a finite group, and X a subset of G. The Cayley graph of G with respect to X , written Cay(G,X) has two different definitions in the literature. The vertex set of this graph is the group G. In one definition, there is an arc from g to xg for all g ∈ G and x ∈ X ; in the other definition, for the same pairs (g,x), there is an arc from g to gx. Cayley graphs are generalised by coset grap...
متن کاملLegendrian Graphs and Quasipositive Diagrams
In this paper we clarify the relationship between ribbon surfaces of Legendrian graphs and quasipositive diagrams by using certain fence diagrams. As an application, we give an alternative proof of a theorem concerning a relationship between quasipositive fiber surfaces and contact structures on S. We also answer a question of L. Rudolph concerning moves of quasipositive diagrams.
متن کاملChromatically Unique Multibridge Graphs
Let θ(a1, a2, · · · , ak) denote the graph obtained by connecting two distinct vertices with k independent paths of lengths a1, a2, · · · , ak respectively. Assume that 2 ≤ a1 ≤ a2 ≤ · · · ≤ ak. We prove that the graph θ(a1, a2, · · · , ak) is chromatically unique if ak < a1 + a2, and find examples showing that θ(a1, a2, · · · , ak) may not be chromatically unique if ak = a1 + a2.
متن کاملState Dependent Multi channel Queuing System with Ordered Entry
In the present study, we analyze the multi-channel service system with ordered entryfrom finite-source and finite-storage at each channel. The arrival and service rates are assumedto be state dependent. The steady state probabilities of the system are obtained by usingChapmann-Kolmogorov equations. Some other performance indices viz. utilization of servers,expected number of units in the system...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1974
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(74)90766-9